#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
priority_queue<LL>que;
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL n;cin>>n;
    for(LL i=1;i<=n;i++) cin>>a[i];
    LL ans=0;LL res=0;
    for(LL i=1;i<=n;i++){
        if(a[i]>=0) ans++,res+=a[i];
        else{
            while(!que.empty()&&que.top()>-a[i]&&res+a[i]<0){
                  res+=que.top();que.pop();ans--;
            }
            if(res+a[i]>=0) ans++,res+=a[i],que.push(-a[i]);
        }
    }
    cout<<ans<<"\n";
   	return 0;
}
